Linear N-decompositions and tri-diagonal matrices
نویسندگان
چکیده
منابع مشابه
Extremal Properties of Balanced Tri-Diagonal Matrices
If A is a square matrix with distinct eigenvalues and D a nonsingular matrix, then the angles between rowand column-eigenvectors of D~XAD differ from the corresponding quantities of A. Perturbation analysis of the eigenvalue problem motivates the minimization of functions of these angles over the set of diagonal similarity transforms ; two such functions which are of particular interest are the...
متن کاملRepresentations and Bounds for Zeros of Orthogonal Polynomials and Eigenvalues of Sign-Symmetric Tri-diagonal Matrices
where P ,(.\-) = 0, P,,(.\-) = I. So without loss of generality MC can take the simpler recurrence formula ( I .2), where c’,, is real and i,, , :> 0 (,I > 0). ;I\ ;I starting point for our analysis. Note that the value ol’ i, i4 irrelevant: it bill bc convenient. however. to assume i , = I. It is well known (see [3]) that P,,(.\) has II real. distinct /eras I,,, c Y,~’ < < I,,,,. Moreover. the...
متن کاملDiagonal and Low-Rank Matrix Decompositions, Correlation Matrices, and Ellipsoid Fitting
In this paper we establish links between, and new results for, three problems that are not usually considered together. The first is a matrix decomposition problem that arises in areas such as statistical modeling and signal processing: given a matrix X formed as the sum of an unknown diagonal matrix and an unknown low rank positive semidefinite matrix, decompose X into these constituents. The ...
متن کاملTrace formula and Spectral Riemann Surfaces for a class of tri-diagonal matrices
For tri-diagonal matrices arising in the simplified Jaynes– Cummings model, we give an asymptotics of the eigenvalues, prove a trace formula and show that the Spectral Riemann Surface is irreducible.
متن کاملGeneralized Scans and Tri-Diagonal Systems
Motivated by the analysis of known parallel techniques for the solution of linear tridiagonal system, we introduce generalized scans, a class of recursively de ned lengthpreserving, sequence-to-sequence transformations that generalize the well-known pre x computations (scans). Generalized scan functions are described in terms of three algorithmic phases, the reduction phase that saves data for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1977
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(77)90287-x